Fast inverse transform sampling in one and two dimensions
نویسندگان
چکیده
We develop a computationally efficient and robust algorithm for generating pseudo-random samples from a broad class of smooth probability distributions in one and two dimensions. The algorithm is based on inverse transform sampling with a polynomial approximation scheme using Chebyshev polynomials, Chebyshev grids, and low rank function approximation. Numerical experiments demonstrate that our algorithm outperforms existing approaches.
منابع مشابه
Fast, exact (but unstable) spin spherical harmonic transforms
We derive algorithms to perform a spin spherical harmonic transform and inverse for functions of arbitrary spin number. These algorithms involve recasting the spin transform on the two-sphere S as a Fourier transform on the two-torus T. Fast Fourier transforms are then used to compute Fourier coefficients, which are related to spherical harmonic coefficients through a linear transform. By recas...
متن کاملReconstructing Multivariate Trigonometric Polynomials by Sampling along Generated Sets
The approximation of problems in d spatial dimensions by sparse trigonometric polynomials supported on known or unknown frequency index sets I ⊂ Zd is an important task with a variety of applications. The use of a generalization of rank1 lattices as spatial discretizations offers a suitable possibility for sampling such sparse trigonometric polynomials. Given an index set of frequencies, we con...
متن کاملThe Discrete Fourier Transform, Part 2: Radix 2 FFT
This paper is part 2 in a series of papers about the Discrete Fourier Transform (DFT) and the Inverse Discrete Fourier Transform (IDFT). The focus of this paper is on a fast implementation of the DFT, called the FFT (Fast Fourier Transform) and the IFFT (Inverse Fast Fourier Transform). The implementation is based on a well-known algorithm, called the Radix 2 FFT, and requires that its' input d...
متن کاملSea Surfaces Scattering by Multi-Order Small-Slope Approximation: a Monte-Carlo and Analytical Comparison
L-band electromagnetic scattering from two-dimensional random rough sea surfaces are calculated by first- and second-order Small-Slope Approximation (SSA1, 2) methods. Both analytical and numerical computations are utilized to calculate incoherent normalized radar cross-section (NRCS) in mono- and bi-static cases. For evaluating inverse Fourier transform, inverse fast Fourier transform (IFFT) i...
متن کاملThe Discrete Fourier Transform, Part 3: The PSD
This paper is part 3 in a series of papers about the Discrete Fourier Transform (DFT) and the Inverse Discrete Fourier Transform (IDFT). The focus of this paper is on computing the Power Spectral Density (PSD) of the FFT (Fast Fourier Transform) and the IFFT (Inverse Fast Fourier Transform). The implementation is based on a well-known algorithm, called the decimation in time Radix 2 FFT, and re...
متن کامل